- Home
- Search Results
- Page 1 of 1
Search for: All records
-
Total Resources4
- Resource Type
-
0000000004000000
- More
- Availability
-
40
- Author / Contributor
- Filter by Author / Creator
-
-
Curtis, Frank E. (2)
-
O’Neill, Michael (2)
-
O’Neill, Michael J. (2)
-
Robinson, Daniel P. (2)
-
Adhikari, Laxman (1)
-
Airapetian, Vladimir (1)
-
Albers, Joshua (1)
-
Alberti, Tommaso (1)
-
Alfred, De Wijn (1)
-
Anastasiadis, Anastasios (1)
-
Andretta, Vincenzo (1)
-
Antolin, Patrick (1)
-
Athanasios, Kouloumvakos (1)
-
Auchère, Frédéric (1)
-
Aulanier, Guillaume (1)
-
Badman, Samuel (1)
-
Bahauddin, Shah (1)
-
Balasis, Georgios (1)
-
Bale, Stuart (1)
-
Bandyopadhyay, Riddhi (1)
-
- Filter by Editor
-
-
& Spizer, S. M. (0)
-
& . Spizer, S. (0)
-
& Ahn, J. (0)
-
& Bateiha, S. (0)
-
& Bosch, N. (0)
-
& Brennan K. (0)
-
& Brennan, K. (0)
-
& Chen, B. (0)
-
& Chen, Bodong (0)
-
& Drown, S. (0)
-
& Ferretti, F. (0)
-
& Higgins, A. (0)
-
& J. Peters (0)
-
& Kali, Y. (0)
-
& Ruiz-Arias, P.M. (0)
-
& S. Spitzer (0)
-
& Sahin. I. (0)
-
& Spitzer, S. (0)
-
& Spitzer, S.M. (0)
-
(submitted - in Review for IEEE ICASSP-2024) (0)
-
-
Have feedback or suggestions for a way to improve these results?
!
Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher.
Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?
Some links on this page may take you to non-federal websites. Their policies may differ from this site.
-
A sequential quadratic optimization algorithm is proposed for solving smooth nonlinear-equality-constrained optimization problems in which the objective function is defined by an expectation. The algorithmic structure of the proposed method is based on a step decomposition strategy that is known in the literature to be widely effective in practice, wherein each search direction is computed as the sum of a normal step (toward linearized feasibility) and a tangential step (toward objective decrease in the null space of the constraint Jacobian). However, the proposed method is unique from others in the literature in that it both allows the use of stochastic objective gradient estimates and possesses convergence guarantees even in the setting in which the constraint Jacobians may be rank-deficient. The results of numerical experiments demonstrate that the algorithm offers superior performance when compared with popular alternatives.more » « less
-
Curtis, Frank E.; O’Neill, Michael J.; Robinson, Daniel P. (, Mathematical Programming)
-
Royer, Clément W.; O’Neill, Michael; Wright, Stephen J. (, Mathematical Programming)
-
Raouafi, Nour E.; Hoeksema, J. Todd; Newmark, Jeffrey S.; Gibson, Sarah; Berger, Thomas E.; Upton, Lisa A.; Vourlidas, Angelos; Hassler, Donald M.; Kinnison, James; Ho, George C.; et al (, Bulletin of the AAS)This white paper is on the HMCS Firefly mission concept study. Firefly focuses on the global structure and dynamics of the Sun's interior, the generation of solar magnetic fields, the deciphering of the solar cycle, the conditions leading to the explosive activity, and the structure and dynamics of the corona as it drives the heliosphere.more » « less
An official website of the United States government
